Ehrhart theory, modular flow reciprocity, and the Tutte polynomial

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ehrhart theory, modular flow reciprocity, and the Tutte polynomial

Given an oriented graph G, the modular flow polynomial φG(k) counts the number of nowhere-zero Zk-flows of G. We give a description of the modular flow polynomial in terms of (open) Ehrhart polynomials of lattice polytopes. Using Ehrhart–Macdonald reciprocity we give a combinatorial interpretation for the values of φG at negative arguments which answers a question of Beck and Zaslavsky (Adv Mat...

متن کامل

Multidimensional Ehrhart Reciprocity 1

In [1], the author generalized Ehrhart’s idea ([2]) of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vertices, we use its description as the intersection of halfspaces, which determine the facets of the polytope. Instead of just a single dilation factor, we allow different dilation factors for each of these facets. We proved ...

متن کامل

Ehrhart-macdonald Reciprocity Extended

For a convex polytope P with rational vertices, we count the number of integer points in integral dilates of P and its interior. The Ehrhart-Macdonald reciprocity law gives an intimate relation between these two counting functions. A similar counting function and reciprocity law exists for the sum of all solid angles at integer points in dilates of P . We derive a unifying generalization of the...

متن کامل

On the tutte polynomial of benzenoid chains

The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.

متن کامل

The Tutte polynomial

This is a close approximation to the content of my lecture. After a brief survey of well known properties, I present some new interpretations relating to random graphs, lattice point enumeration, and chip firing games. I then examine complexity issues and concentrate in particular, on the existence of randomized approximation schemes. © 1999 John Wiley & Sons, Inc. Random Struct. Alg., 15, 210–...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematische Zeitschrift

سال: 2010

ISSN: 0025-5874,1432-1823

DOI: 10.1007/s00209-010-0782-6